Generalized offsetting of planar structures using skeletons
نویسندگان
چکیده
منابع مشابه
Generalized Offsetting Using a Variable-Radius Voronoi Diagram
We investigate ways to extend offsetting based on skeletal structures beyond the well-known constant-radius and mitered offsets supported by Voronoi diagrams and straight skeletons for which the orthogonal distance of offset elements to their input elements is uniform. We introduce a new geometric structure called the variableradius Voronoi diagram, which supports the computation of variable-ra...
متن کاملRepresenting Volumetric Vascular Structures Using Curve Skeletons
This paper describes a technique to represent relevant information of tree-like structures in a compact way. The technique is general. In the application described here, the images are obtained with contrast-enhanced magnetic resonance angiography (MRA). After segmentation, the vessels are reduced to fully reversible surface skeletons. Thereafter, a novel approach to curve skeletonization based...
متن کاملUsing Algorithmic Skeletons with Dynamic Data Structures
Algorithmic skeletons are polymorphic higher-order functions representing common parallelization patterns. A special category are data-parallel skeletons, which perform operations on a distributed data structure. In this paper, we consider the case of distributed data structures with dynamic elements. We present the enhancements necessary in order to cope with these data structures, both on the...
متن کاملGeneralized $\beta$-skeletons
β-skeletons, a prominent member of the neighborhood graph family, have interesting geometric properties and various applications ranging from geographic networks to archeology. This paper focuses on developing a new, more general than the present one, definition of β-skeletons based only on the distance criterion. It allows us to consider them in many different cases, e.g. for weighted graphs o...
متن کاملPlanar Matchings for Weighted Straight Skeletons
In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design and Applications
سال: 2016
ISSN: 1686-4360
DOI: 10.1080/16864360.2016.1150718